Optimal dynamic resource allocation to prevent defaults

نویسندگان

  • Urtzi Ayesta
  • Martin Erausquin
  • Eva Ferreira
  • Peter Jacko
چکیده

We consider a resource allocation problem, where a rational agent has to decide how to share a limited amount of resources among different companies that might be facing financial difficulties. The objective is to minimize the total long term cost incurred by the economy due to default events. Using the framework of multiarmed restless bandits and, assuming a two-state evolution of the default risk, the optimal dynamic resource sharing policy is determined. This policy assigns an index value to each company, which orders its priority to be funded. We obtain an analytical expression for this index, which generalizes the return-on-investment (ROI) index under the static setting, and we analyse the influence of the future events on the optimal dynamic policy. A discussion about the structure of the optimal dynamic policy is provided, as well as some extensions of the model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMAL RESOURCE ALLOCATION IN DEA WITH INTEGER VARIABLES

Resource allocation and optimal leveling are among the top challenges in project management. This paper presents a DEA-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. To achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all DMUs. Such as some of...

متن کامل

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

متن کامل

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

Bicriteria Resource Allocation Problem in Pert Networks

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...

متن کامل

A review of methods for resource allocation and operational framework in cloud computing

The issue of management and allocation of resources in cloud computing environments, according to the breadth of scale and modern technology implementation, is a complicated issue. Issues such as: the heterogeneity of resources, resource dependencies to each other, the dynamics of the environment, virtualization, workload diversity as well as a wide range of management objectives of cloud servi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2016